翻訳と辞書 Words near each other ・ Circulating microvesicle ・ Circulating pump ・ Circulating tumor cell ・ Circulating Water Plant ・ Circulation ・ Circulation (architecture) ・ Circulation (currency) ・ Circulation (film) ・ Circulation (fluid dynamics) ・ Circulation (journal) ・ Circulation control wing ・ Circulation evaporators ・ Circulation Festival ・ Circulation of elite ・ Circulation plan ・ Circulation problem ・ Circulation Research ・ Circulation Verification Council ・ Circulator ・ Circulator (disambiguation) ・ Circulator pump ・ Circulatory anastomosis ・ Circulatory collapse ・ Circulatory system ・ Circulatory System (album) ・ Circulatory System (band) ・ Circulatory system of gastropods ・ Circulatory system of the horse ・ Circulene ・ Circulez y'a rien à voir Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Circulation problem ： ウィキペディア英語版 Circulation problem The circulation problem and its variants are a generalisation of network flow problems, with the added constraint of a lower bound on edge flows, and with flow conservation also being required for the source and sink (i.e. there are no special nodes). In variants of the problem, you have multiple commodities flowing through the network, and a cost on the flow. == Definition == Given flow network $G(V,E)$ with: :$l(v,w)$, lower bound on flow from node $v$ to node $w$, :$u(v,w)$, upper bound on flow from node $v$ to node $w$, :$c(v,w)$, cost of a unit of flow on $(v,w)$ and the constraints: :$l(v,w)\; \backslash leq\; f(v,w)\; \backslash leq\; u(v,w)$, :$\backslash sum\_\; f(u,w)\; =\; 0$ (flow cannot appear or disappear in nodes). Finding a flow assignment satisfying the constraints gives a solution to the given circulation problem. In the minimum cost variant of the problem, minimize : $\backslash sum\_\; c(v,w)\; \backslash cdot\; f(v,w).$ 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Circulation problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.